Analyzing and generating multimode optical fields using self-configuring networks
نویسندگان
چکیده
منابع مشابه
Towards Self-Configuring Networks
Current networks require ad-hoc operating procedures by expert administrators to handle changes. These configuration management operations are costly and error prone. Active networks[2, 3] involve particularly fast dynamics of change that cannot depend on operators and must be automated. This paper describes an architecture called NESTOR that seeks to replace labor-intensive configuration manag...
متن کاملAnalyzing Multimode Wireless Sensor Networks Using the Network Calculus
The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined method...
متن کاملSelf-configuring universal linear optical component
We show how to design an optical device that can perform any linear function or coupling between inputs and outputs. This design method is progressive, requiring no global optimization. We also show how the device can configure itself progressively, avoiding design calculations and allowing the device to stabilize itself against drifts in component properties and to continually adjust itself to...
متن کاملScalable and Efficient Self-configuring Networks
Managing today’s data networks is highly expensive, difficult, and error-prone. At the center of this enormous difficulty lies configuration: a Sisyphean task of updating operational settings of numerous network devices and protocols. Much has been done to mask this configuration complexity intrinsic to conventional networks, but little effort has been made to redesign the networks themselves t...
متن کاملGenerating and analyzing spatial social networks
In this paper, we propose a class of models for generating spatial versions of three classic networks: Erdös-Rényi (ER), Watts-Strogatz (WS), and BarabásiAlbert (BA). We assume that nodes have geographical coordinates, are uniformly distributed over an m 9 m Cartesian space, and long-distance connections are penalized. Our computational results show higher clustering coefficient, assortativity,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optica
سال: 2020
ISSN: 2334-2536
DOI: 10.1364/optica.391592